翻訳と辞書 |
Cameron–Erdős conjecture : ウィキペディア英語版 | Cameron–Erdős conjecture In combinatorics, the Cameron–Erdős conjecture (now a theorem) is the statement that the number of sum-free sets contained in is subsets of odd numbers in |''N''|. The Cameron–Erdős conjecture says that this counts a constant proportion of the sum-free sets. The conjecture was stated by Peter Cameron and Paul Erdős in 1988.〔.〕 It was proved by Ben Green〔.〕 and independently by Alexander Sapozhenko〔.〕〔.〕 in 2003. ==See also==
* Erdős conjecture
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Cameron–Erdős conjecture」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|